A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds
نویسندگان
چکیده
We use a straightforward bivalency argument borrowed from Fischer et al. [7] to show that in a synchronous system with up to t crash failures solving consensus requires at least t + 1 rounds. The proof is simpler and more intuitive than the traditional one: It uses an easy forward induction rather than a more complex backward induction which needs the induction hypothesis several times.
منابع مشابه
A bivalency proof of the lower bound for uniform consensus
Bivalency argument is a widely-used technique that employs forward induction to show impossibility results and lower bounds related to consensus. However, for a synchronous distributed system of n processes with up to t potential and f actual crash failures, applying bivalency argument to prove the lower bound for reaching uniform consensus is still an open problem. In this paper, we address th...
متن کاملA simple proof of the uniform consensus synchronous lower bound
We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t − 2, there is an execution with f failures that requires f + 2 rounds. 2002 Elsevier Science B.V. All rights reserved.
متن کاملA Topological Treatment of Early-Deciding Set-Agreement
This paper considers the k-set-agreement problem in a synchronous message passing distributed system where up to t processes can fail by crashing. We determine the number of communication rounds needed for all correct processes to reach a decision in a given run, as a function of k, the degree of coordination, and f ≤ t the number of processes that actually fail in the run. We prove a lower bou...
متن کاملNarrowing Power vs. Efficiency in Synchronous Set Agreement
The k-set agreement problem is a generalization of the uniform consensus problem: each process proposes a value, and each non-faulty process has to decide a value such that a decided value is a proposed value, and at most k different values are decided. It has been shown that any algorithm that solves the k-set agreement problem in synchronous systems that can suffer up to t crash failures requ...
متن کاملPerfect Information Leader Election in log*n + O(1) Rounds
In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Protocols proceed in rounds: though players are synchronized between rounds, within each round the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 71 شماره
صفحات -
تاریخ انتشار 1999